منابع مشابه
An Overview of the Theory of Instances Computational Complexity
The theory of the computational complexity is a subject of international interest of scientific, technological and enterprise organizations. The computational complexity contains diverse elements such as the classes of problems complexity (P, NP, NP-hard and NP-complete, and others), complexity of algorithms (it is a way to classify how efficient is an algorithm by means the execution time to s...
متن کاملlURING AWARD LECTURE AN OVERVIEW OF COMPUTATIONAL COMPLEXITY
Author's Present Address: Stephen A. Cook, Department of Computer Science, University of Toronto, Toronto, Canada M5S 1A7. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by...
متن کاملComputational Aeroacoustics: An Overview
An overview of recent advances in computational aeroacoustics (CAA) is presented. CAA algorithms must not be dispersive and dissipative. It should propagate waves supported by the Euler equations with the correct group velocities. Computation domains are inevitably finite in size. To avoid the reflection of acoustic and other outgoing waves at the boundaries of the computation domain, it is req...
متن کاملan investigation of accuracy and complexity across different proficiency levels in written narrative task
abstract this quasi-experimental study was aimed at examining the impact of storyline complexity on the grammatical accuracy and complexity of advanced and intermediate efl learners. a total of 65 advanced and intermediate efl learners were selected from iran language institute (ili). an intact group including 35 intermediate participants and another intact group with 30 advanced participants ...
The computational complexity of natural language recognition: A tutorial overview*
2 Computational Complexity Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1 What is a computation? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 What is complexity? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Easy, hard and still harder problems: complexity classes . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1983
ISSN: 0001-0782,1557-7317
DOI: 10.1145/358141.358144